Interior-Node-Disjoint Multi-Tree Topology Formation

ABSTRACT

A novel decentralized protocol for constructing a tree-based P2P live video streaming network with the Interior-Node-Disjoint (IND) multi-tree structure with the special Link-Level-Homogeneous property. The IND multi-tree structure recycles the wasted uploading capacities of leaf nodes in the tree-based P2P networks. The IND multi-tree structure also enhances the robustness of the tree-based P2P networks. Moreover, the special Link-Level-Homogeneous property eliminates the bottlenecks in the video delivery paths by ensuring that each downloading link in the network has identical bandwidth reserved. This special designed architecture greatly improves the downloading performance.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application claims priority both from U.S. provisional application 60/952,863, filed Jul. 31, 2007, and also from U.S. application Ser. No. 11/740,252, filed Apr. 21, 2007, and also therethrough from U.S. provisional Application 60/794,462 filed Apr. 25, 2006. All three of these applications are hereby incorporated by reference in their respective entireties.

BACKGROUND

The present application relates to Peer-to-Peer (P2P) communications, and more particularly to the multicast trees topology in a P2P networking environment for the distribution of multimedia contents, such as bulk files, live or on-demand audio or video, etc.

The points below may reflect the hindsight gained from the disclosed inventions and/or from the inventive process, and are NOT admitted to be prior art.

Peer-to-Peer architectures leverage the end terminals to cooperatively disseminate the information instead of relying on any central entities. This approach provides the system with theoretically infinite scalability at virtually no additional cost, and therefore has ignited an explosive growth of large scale Internet services, for instance, KaZaA for file sharing, BT for bulk content distribution and PPlive for live media streaming.

FIG. 10 shows an example of the general architecture of peer-to-peer streaming systems. The original uncompressed video content is generated by the A/V source and injected into the media server. In the media server, the video content is first compressed with the playout rate to be r kbps and then is distributed to users in the peer-to-peer network through multiple video streams. In the peer-to-peer network, the video streams are forwarded among connected nodes, and at each node the downloading video content is simultaneously played by the local media player at the playout rate of r kbps.

An appealing feature of the peer-to-peer networking is that since each participating node contributes its bandwidth to the system to assist uploading, the system can self-scale to support a huge number of users online simultaneously, even for bandwidth consuming media streaming applications. Notice that all these attractive services are bandwidth intensive and normally require stringent QoS requirements. On the other hand, with millions of heterogeneous participants all over the world, organizing the network efficiently to boost the system performance with high service quality is a very difficult problem. Facing these difficulties, traditional approaches for live media streaming can mainly be grouped into three categories based on the involvement of (1) a multicast tree, (2) plural multicast trees, or (3) no tree.

The first category is to build a multicast tree across the network. Video contents are disseminated from the root and passed along the tree from parents to children. Without considering the dynamic behavior of peers, this mechanism is superior with its ease to manage. Optimization can also be easily performed within the tree by intelligently shifting among parents and their children. However, with the intense churnung of ad hoc peers, the cost of tree topology maintenance is high. Further, due to peer departures, the system often needs frequent repairs. Therefore participants will inevitably encounter turbulent QoS with large video quality fluctuation during the repairing phase. Examples of such systems include Narada and Yoid.

To enhance the robustness of the system and allow the clients to enjoy high quality services such as smooth playing of videos, the second category improves the first category by building several multicast trees simultaneously with each tree streaming one strip of the content rooted from a source. Such mechanism often employs advanced coding schemes, e.g., Multiple Description Coding or Fountain Codes, so that by downloading several streams simultaneously from different trees, the participants are able to achieve better video quality and can also tolerate the departures of partial predecessors as long as it can download at least one stream continuously. Such mechanism has been adopted in CoopNet, SplitStream and Bullet.

In the third category, there are no more tree(s) to be maintained. Instead a data-oriented approach chops the original contents into blocks of equal size and disseminates to peers disjointedly. After downloading each block in its entirety, peers can then serve it to other siblings to enhance the system service capacity. In such a scenario, in order to learn the block propagation to chase needed blocks, each peer needs to collect the block information of certain amount of peers periodically and react against the run up of fresh blocks or other accidents such as neighbor departures, heavy congestion, etc. With the unceasingly active local modifications, the network commotion will only affect several block sessions of a peer normally, and therefore the system is more robust than that of the previous tree(s) structure. For this reason, the data driven approach is widely employed in practice, for instance BT, CoolStream and PPlive. However, such mechanism makes the network even more turbulent and difficult to optimize.

With the great success of PPlive and CoolStream, large scale live streaming service has already been relatively mature. However, the term “streaming” is in fact used loosely and inaccurately. There are no general principles to guide designers seeking for an optimal system. Large scale Video-on-Demand (VoD) service, with more stringent QoS requirements and less available cooperation among peers, is far from satisfactory and still under serious research without any real systems implemented.

The rapid development of broadband residential networks has further heated up interest in large scale high quality video delivery service over the Internet. The great commercial opportunities for Internet video service have resulted in a rapid growth in the demand for a reliable live video streaming system with high quality of service (QoS) guarantee. With the failure of IP multicast, the peer-to-peer (P2P) video streaming has recently emerged as a promising and effective alternative approach. Many P2P live video streaming systems have been proposed, notably vPPLive, CoolStreaming, and End System Multicast.

One of the promising P2P multicast schemes for live video streaming applications is tree-based multicasting. Tree based P2P networks provide relatively static video delivery paths, so that the video distribution is very efficient. In tree-based P2P networks, one approach to deliver the video data is by forming a single multicast tree in the overlay with video stream delivered from the root to peers using one-way communication. However, the present inventors have realized that, due to the hierarchical structure of the tree-based P2P networks, single tree video streaming approaches have two major problems: (1) inefficient usage of leaf nodes' uploading bandwidth; and (2) sensitive to node departures. The reason behind these problems is that the forwarding of the video stream is carried out by a small subset of peers which act as interior nodes in the tree.

One effort, SplitStream, introduces a very powerful multi-tree structure, named Interior-Node-Disjoint (IND) multi-tree, to recycle the uploading bandwidth of leaf nodes and improve the robustness. The key idea of SplitStream is that every peer in the network takes part in the forwarding of the video streams by serving as an interior node in one tree of the multi-tree structure. However, SplitStream does not solve the bottleneck problem caused by the heterogeneous bandwidth of peers in multitree P2P networks, a problem also referred to as capacity aware topology formation problem. The few proposed solutions focus on how to achieve a predefined target workload for each peer in terms of number of child nodes. However, they failed to address how to determine the optimal target workload.

SUMMARY

The disclosed inventions provide a multi-tree topology in which the workload for every peer is optimally determined, so that peers have equal downloading rate. Furthermore, when constructing the topology the parent node selecting region is restricted to preserve the interior-node-disjoint (“IND”) property, thus solving many problems of tree-based P2P networks. The disclosed approach distributes the workload of forwarding video streams to every participating peer according to its uploading capacity. In addition to a centralized solution, a novel decentralized parent selecting approach is also proposed to select parent nodes for each new join-in node. The parent selecting algorithm builds a Link-Level-Homogeneous network such that video streams traffic flows through multiple video delivery trees without suffering from any overlay bottleneck so that high quality video delivery can be achieved.

The advantages of the proposed approaches, in various embodiments, include, among others, the following:

-   -   The proposed approaches recycle the wasted uploading capacities         of leaf nodes in the tree-based P2P networks.     -   The proposed approaches eliminate the bottlenecks in the video         delivery paths by ensuring that each downloading link in the         network has identical bandwidth reserved.     -   The proposed approaches provide high throughput since the         available bandwidth is utilized efficiently.     -   The proposed approaches are scalable for decentralized         implementation.     -   The proposed approaches enhance the robustness of the tree-based         P2P networks since a node will distribute at most one stream at         a time and therefore is quick to recover from link down or node         failure.     -   Finally, the proposed approaches allow the end user to enjoy         high quality of video streaming service with guaranteed QoS.

BRIEF DESCRIPTION OF THE DRAWINGS

The disclosed inventions will be described with reference to the accompanying drawings, which show important sample embodiments of the invention and are incorporated in the specification hereof by reference, wherein:

FIG. 1 shows an example of the disclosed double-plane architecture for one of the video stream delivery trees.

FIG. 2 shows an example of Interior-Node-Disjoint multi-tree structure with two trees.

FIG. 3 shows simulation results of the relationship between the connectivity parameter m and accurate sampling rate.

FIG. 4 shows simulation results of the mean and the standard deviation of the iterations needed for different values of the connectivity parameter m.

FIG. 5 shows simulation results of the distribution of the link capacities for active nodes in the two different networks, according to at least some embodiments.

FIG. 6 shows comparative simulation results of the distribution of averaged downloading rates for each downloading link in networks built with and without the disclosed approach, according to at least some embodiments.

FIG. 7 schematically shows an example of an interior-node-disjoint multitree structure.

FIGS. 8A/8B schematically show how a parent node is identified when a new node H joins a tree structure, which in this example includes only node A-G,

FIG. 9 shows how weightings can be calculated, in the example of FIGS. 8A/8B, to assist in finding the optimal host connection.

FIG. 10 shows an overview of a complete live video streaming system.

DETAILED DESCRIPTION

The numerous innovative teachings of the present application will be described with particular reference to the presently preferred embodiment (by way of example, and not of limitation).

The preferred embodiments of the present inventions and their advantages are best understood by referring to FIGS. 1 through 10 of the drawings. Without loss of generality, the teaching sometimes discusses one multicast tree (or video stream) so that all the peers in the tree are downloading the same video content. However, the disclosed inventions are NOT limited to one multicast tree, and one skilled in the art will easily apply the teaching to multiple multicast trees.

Network Model and Methodology A. P2P Network Model

Suppose that we assume that the downloading bandwidth is not a bottleneck, i.e., the participating peers have sufficient bandwidth to download video streams from the networks. This assumption is reasonable for P2P live video streaming systems since any optimization of the networks is useless to end users who do not have a sufficient downloading bandwidth. Furthermore, any correlation between the P2P overlay logical links (i.e., shared congested links in the IP layer) is also not considered.

In a heterogeneous network such as the Internet, the different Internet access connections (e.g., ranging from dial-up modem to wireless LAN) lead to heterogeneous uploading capacities. X_(l) is defined to be the uploading capacity for node l, and K_(l), the number of child nodes for node l. Assuming that a parent node uniformly divides its uploading bandwidth to serve its child nodes, then the term “link capacity” is used to indicate the uploading bandwidth reserved for each child node. If δ₁ indicates the link capacity for node l, then δ_(l)=X_(l)/K_(l). A leaf node's link capacity is considered to be equal to that node's capacities. Note that δ_(l) is a very important and useful metric for measuring the downloading quality. A bottleneck problem will occur at those nodes that have a small value of δ_(l).

B. IND Multi-Tree Structure and Control Planes

The disclosed approach maintains an Interior-Node-Disjoint (IND) multi-tree structure. A set of trees is said to be IND if each node is an interior node in only one tree, and a leaf node in the other trees. FIG. 2 is an example of IND multi-tree with two trees. In this example, nodes 1 and 3 are interior nodes in a tree (linked by a solid line) and leaf nodes in another tree (linked by dotted lines), while nodes 2 and 4 are just opposite. An IND structure provides excellent robustness and shows great potential for those applications that depend on reliable topology structure.

FIG. 7 schematically shows another example of an interior-node-disjoint multitree structure. Note that nodes F and G are interior nodes in Tree 2, but are merely leaf nodes in Tree 1. Similarly, note that node E is an interior node in Tree 1, but merely a leaf node in Tree 2. Tree 1 and Tree 2 can advantageously be used, for example, to carry two different substreams of the same video flow.

The preferred embodiment assumes that the IND multi-tree structure contains T trees. Each node attaches to all T trees to download T video streams. To maintain IND property, nodes select one video stream from their receiving video streams and forward the stream to their child nodes. Because each node only forwards one stream, it acts as an interior node in one tree and a leaf node in the other trees.

The preferred embodiment utilizes a double-plane architecture: control plane and content delivery plane. The control plane is used to exchange control messages to control the changes to the tree and the content delivery plane is used to deliver video stream through multicast tree.

For each video stream delivery tree, a control plane is maintained. A control plane is simply a random mesh graph G=(V, ε) with node set V and edge set ε⊂V×V, facilitating the flows of control data among those interior nodes in the tree. To separate the interior nodes from the leaf nodes, only the interior nodes in the corresponding tree are included in V. Among those interior nodes in the same control plane, control connections are randomly established. These random control connections are represented by bidirectional links in ε. Two nodes connected by a link in ε are referred to as logical neighbors of each other. In order to ensure a good connectivity for the control planes, nodes in the control planes obtain at least μ logical neighbors when they join the network. μ reflects the connectivity of the control plane, and is denoted as the connectivity parameter.

FIG. 1 shows an example of the disclosed double-plane architecture for one video stream delivery tree in a multi-tree structure. The control plane is used to exchange control messages to control the changes to the tree and the content delivery plane is used to deliver video stream through the multicast tree. Note that the control planes are not necessarily full mesh graphs. To obtain current status of logical neighbors, the information is exchanged along the control connections in the corresponding control planes.

With the help of control planes, a participating node is aware of the current status of its logical neighbors (e.g., the uploading capacity and the number of child nodes). This information helps to determine the suitable parent nodes for the new joining nodes. Note that control planes only contain the interior nodes within one tree. The preferred embodiment makes sure that each node appears in at most one control plane to preserve IND property. In order to maintain the control planes in a distributed manner, each node in the network maintains one logical neighbor set B to store the information of its logical neighbors.

C. Selecting Parent

The main objective of the parent selecting algorithm is to form the balanced multi-tree topology which has Link-Level-Homogeneous property to avoid bottlenecks. The preferred embodiment systematically analyzes the workload for active nodes in the network by using the metric of link capacity δ which reflects the workload of nodes quantitatively. A heavily overloaded node might have an excessive number of child nodes and its δ value is relatively small. These overloaded nodes cannot provide significant uploading bandwidth to deliver the video streams to their child nodes, and where bottlenecks emerge. Although underloaded nodes have a relatively larger δ value, they cannot be of much benefit when there are bottlenecks at those overloaded nodes. To balance the forwarding workload, nodes with high uploading capacity are assigned with more child nodes while nodes with small uploading capacity are assigned with less child nodes.

The disclosed parent selecting approach connects the new join-in nodes to those nodes with high link capacity (i.e., those node whose uploading capacities are not fully utilized) to achieve workload balance. Normally in a P2P network nodes arrive and depart in sequence. The P2P network evolves by adding or removing nodes one by one. In each step when a new node joins, the node with the highest link capacity is chosen and connected to the new joining node as parent node. After the new child node is connected to this node, the parent node's link capacity δ shrinks and it becomes less attractive to new incoming nodes in the future. Any departure of a child node reduces the workload of its parent node and increases its δ so that the parent node becomes attractive to the new join-in nodes again. The disclosed approach assigns a child node to the node with the highest link capacity so as to increase its workload and draw down its link capacity. The node selected by this parent selecting approach will be the best parent node candidate, because it has the lightest workload. When a node obtains proper workload, its link capacity becomes similar to the link capacities of other balanced nodes. This node is said to be have converged. Nodes converge after they stay in the network for a short time and receive proper workload. Because the typical number of child nodes is small, nodes only wait for a short time before they obtain proper workload. Thus most of the nodes in the network converge and hle ave identical link capacity. The Link-Level-Homogeneous property is achieved. For those new nodes that have not converged, they normally do not have many child nodes and are underloaded. Their link capacities are large so that they won't be bottlenecks.

FIGS. 8A, 8B, and 9 give an overview of the parent selecting process. FIG. 8A shows a tree structure before the arrival of a new node H. In this notional example, assume that the available bandwidth, and available CPU power for each node, are (in arbitrary units):

Node A: 10, 20%; Node B: 15, 18%; Node C: 2, 35%; Node D: 10, 55%; Node E: 36, 65%; Node F: 25, 84%; Node G: 20, 25%.

FIG. 9 illustrates this same tree, with the bandwidths shown. As described below, this gives an example of parameters used to guide the transition probabilities of the walker process.

FIG. 8B shows the structure of FIG. 8A, and also shows two possibilities for the attachment of the new node H. Note that the available bandwidth values for nodes E, F, and G are similar enough that attachment to any one of them is possible (due to the stochasticity of the process), but attachment to nodes A-D is far less likely.

A sampling algorithm is needed to select the node with the highest link capacity. The preferred embodiment implements the iterative random greedy algorithm upon the control planes to locate the node with the largest link capacity. The iterative random greedy algorithm starts sampling a suitable parent node for one particular tree by sending a walker packet to a random entry in the corresponding control plane. The node which has received the walker packet recursively forwards it to one of its logical neighbors which has a larger link capacity value until the walker packet reached a node which contains the largest link capacity compare with its logical neighbors' link capacities. The iterative random greedy algorithm returns this node as the sampled parent node. Note that this sampled parent node may not be the one with the highest link capacity in the network because greedy algorithm has a well known drawback: it may locate a node with local maximum link capacity instead of the global maximum link capacity. Enhancing the control plane's connectivity can reduce the probability that the greedy algorithm mistakenly locates a local optimal node instead of a global optimal one. The preferred embodiment further minimizes this probability by introducing randomness in forwarding the walker packet.

Another class of preferred embodiments is a random greedy algorithm: for each node which received the walker packet, when there are multiple logical neighbors with a higher link capacity value, it randomly forwards the walker packet to one of the node with higher link capacity with equal probability instead of forwarding the walker packet to the neighbor which has the largest link capacity. The difference of a random greedy algorithm to a deterministic greedy algorithm is that the walker packet is forwarded randomly instead. The probability that the walker packet is trapped at a local maximum is reduced. From the network's point of view, inaccurate sampling does not harm the main objective of the parent selecting algorithm. The local maximum nodes are also underloaded nodes with high link capacity which are proper parent node candidates. They will eventually become attractive and be selected after those nodes with even higher link capacities converged. The inaccurate sampling only affects the converging speed of the underloaded nodes. Furthermore, the entry into the control plane is randomly picked from the existing nodes so as to provide different paths for walker packets to reach the target node. An attractive parent node candidate will eventually be sampled.

Detailed Procedures Join-In, Departure and Rebuild A. Join-In Process

The following discussion assumes that a node attaches to all T trees in a network. The preferred embodiment maintains a bootstrap server to provide random entries for each control plane of the T trees. When a new join-in node initiates the join-in process, the bootstrap server returns T entries each of which belongs to a different control plane. For each control plane, a walker packet is generated and sent to the entry in the corresponding control plane. The walker packet traverses in the control plane for several iterations to locate the parent node. After the T walker packets stop, the last visited nodes are identified as parent nodes, and downloading connections are established to those T parent nodes, and the link capacities of these T parent nodes are reduced. After the T downloading connections are established, these parent nodes immediately update their logical neighbors to inform them the new link capacity value so that when another new node joins the network, its walker packets will be forwarded using the new data.

Now the new join-in node is a leaf node in all the multicast trees. To contribute by uploading one video stream, this new node joins one control plane so that it can be selected by other nodes as a parent node in the corresponding tree in the future. To balance the number of interior nodes in each tree, the new join-in node randomly picks a control plane and joins. To join a control plane, the new node contacts the bootstrap server to obtain μ network addresses (for instance, IP addresses) in the selected control plane randomly. The new node then adds these μ network addresses in its neighbor set as logical neighbors and establishes control connections to them. Now the join-in process is done.

B. Departure and Rebuild Process

Nodes may depart from the network without notification. When a node departs, it tears down the connections between its parent nodes and its child nodes. In the preferred embodiment every node in the network acts as an interior node in one tree, so the departed node disconnects the sub-trees below itself from the main video streaming tree, and all its descendants suffer. Therefore, the immediate child nodes of this departed node must rebuild their connections by attaching to new parent nodes selected in the main video streaming tree.

To preserve IND property and Link-Level-Homogeneous property, the preferred embodiment performs the rebuild process as a join-in process. Note that in the rebuild process the new parent nodes cannot be any node in the disconnected sub-trees. Otherwise, because the control planes are constructed as mesh graphs, walker packets might visit and stop at nodes in the disconnected sub-trees, and thereby create loops in the video delivery paths. To prevent this from happening, the walker packets for rebuilding a tree should not be forwarded to nodes in the disconnected sub-trees. The preferred embodiment introduces prefixed ID for this purpose. Each node has a globally unique ID to specify the hierarchical structure of the video streaming tree in which it serves as interior node. To indicate the parent-child relationship, each child node inherits its parent node's ID in the same control plane as prefix. Besides the prefix, a unique postfix is added to the ID to distinguish among those child nodes that share the same parent node in the same control plane. By assigning different IDs for the root nodes of the T trees in the network, interior nodes in different trees inherit different prefixes. With the prefixed ID defined above, the video stream delivery trees become prefix trees. Descendants inherit ancestors' ID as prefix so that IDs of nodes in any sub-tree contain the same prefix. With the help of the prefixed ID, the nodes in the disconnected sub-trees can be located. The rebuild process is then carried out as join-in process.

Simulation Results

A sample implemented embodiment is referred to as “Homospread.” This is a protocol built based on disclosed inventions and is evaluated by simulations. First, the performance of the iterative random greedy algorithm is evaluated. Then, the performance of the HomoSpread network is compared with the performance of a randomly built multi-tree network. The P2P networks are simulated as follows: Each node i is assigned a non-zero uploading capacity Ci which is uniformly chosen from 256 to 5000;

The join-in of nodes are modeled as Poisson arrival with an arrival rate of μ; and The inter-arrival time of the node departure events is exponentially distributed with mean 1/μ. Initially the network has only T root nodes for the T trees. With the above setting, the simulated network will eventually grow from N_(init)=T until the network reaches the stabilizing phase and has a converged total population of N_(stabilizing)=λ/μ.

A. Accurate Sampling Rate

The performance of the parent node selecting algorithm determines how well the HomoSpread's protocol achieves the Link-Level-Homogeneous property. Compared with the optimal parent node selecting algorithm which always returns parent node with the highest link capacity in the control plane, the performance of proposed parent node selecting algorithm is degraded. To quantitatively measure the decay of the performance, a measurement metric called “accurate sampling rate” is defined as the probability that the iterative random greedy algorithm returns the accurate global maximum node with highest link capacity. The accurate sampling depends on the connectivity of the control plane. When the connectivity parameter m is larger, nodes have more logical neighbors and the connectivity of the control plane is better. The more neighbors that a node exchanges information with, the higher probability that the iterative random greedy algorithm can locate the global optimal node. To show the relationship between the connectivity parameter m and the accurate sampling rate, the simulations are run with different values of m to get the accurate sampling rates.

A simulation set was defined with T=3, μ=1000, and μ=1, so that the total population N_(stabilizing)=1000. FIG. 3 shows the relationship between the connectivity parameter m and accurate sampling rate. The results show that the accurate sampling rate increases when m increases. It agrees with the analysis. After m is larger than 300, the iterative random greedy algorithm can always locate the global optimal node. This makes sense because each control plane only contains interior nodes for one tree. For N=1000 and T=3, there are only around 333 nodes in one control plane. With m=300, the control plane becomes nearly a full mesh graph. In a full mesh graph, the local optimal node is the same as the global optimal node. In this case, the greedy algorithm can always locate the global optimal one. The above results show that increasing the number of trees reduces the number of nodes in the control planes which, in turn, reduces the required value of m to achieve certain degree of accurate sampling rate.

B. Initial Delay for Parent Selection

To locate a suitable parent node, a walker packet is forwarded from node to node so that certain amount of control traffic is created and would contribute to network delay during transmissions. When a new node joins the network, it experiences an initial delay waiting for the walker packet to find a target parent node. In order to reduce this delay, the number of iterations of the parent selecting should be kept small. The number of iterations needed to locate a parent node depends on the connectivity of the control plane, which, in turn, depends on the number of logical neighbors a node has. Simulation here is carried out with the same settings as the pervious simulation to evaluate the relationship between the connectivity parameter m and the number of iterations required to select a parent node. FIG. 4 shows the mean value and the standard deviation of the iterations needed for different values of m. The mean value of the iterations needed converges to a value at around 4.5 as m increases. This result indicates that when the connectivity of the control plane reaches certain degree, the walker packet is forwarded for 4.5 times on average before it located a good parent node. The value of standard deviation also converges to a value at around 2. A small constant value of standard deviation suggests that the actual number of iterations needed for sampling a parent node is well bounded around the mean value.

The above simulation results can be explained by the Small-World phenomenon of P2P networks. In a dense mesh graph like the control plane in the HomoSpread network, there are only a few hops between any two nodes. One participating node can reach any other node within only a few jumps. FIG. 4 shows that when m is small, the control plane is not dense enough so that the Small-World phenomenon is not dominant. Walker packets are easily trapped at local optimal nodes after one or two iterations. When m becomes larger, the Small-World phenomenon becomes dominant and the walker packets are able to sample parent nodes within a constant number of iterations.

C. Network Performance

This simulation evaluates how well disclosed parent node selection algorithm achieves Link-Level-Homogeneous property by examining the link capacities of nodes in the network. Ideally link capacities in the Link-Level-Homogeneous network should be identical, but in the real implementations of the P2P networks, there are several factors such as quantization error that make it impossible for nodes to have exactly the same link capacity. In the simulation, the distribution of the link capacities of nodes in the network is investigated, and the performance gained by the Link-Level-Homogeneous property is also measured as the downloading rate increases for each downloading link of nodes.

Two networks are constructed: the HomoSpread network and the randomly built multi-tree network. In the randomly built network, the parent node is selected randomly. The simulation parameters are: T=10, m=50, λ=10000, and μ=1. The total population in the stabilizing phase is 10000. FIG. 5 shows the distribution of the link capacities for active nodes in the two different networks. For the randomly built network, the link capacities of nodes spread in a very large range, so more nodes have small link capacity. The small link capacity nodes are mainly those nodes that have been in the network for a while. Those nodes adopt too many child nodes (and thus become overloaded), because the longer a node stays in the network, the more child nodes it has. Although there are some nodes that have a very high link capacity, they cannot fully utilize the capacity because their downloading rates of video streams are heavily limited by bottlenecks.

Unlike the randomly built network, the distribution of link capacities for nodes in the HomoSpread network focus in a very compact region with a “long tail” shape. The long tail of the distribution mainly consists of a few newly joined nodes that have not yet converged. These new nodes have not obtained enough child nodes so that their link capacity is relatively larger. The above simulation results show that the disclosed parent node selecting algorithm is able to construct a very good Link-Level-Homogeneous network. Because the Link-Level-Homogeneous property eliminates the downloading bottlenecks, Improvements of downloading rates for nodes are expected. FIG. 6 shows the distribution of averaged downloading rates for each downloading link in HomoSpread network and in randomly built network. The mean value of the averaged downloading rates in the HomoSpread network is nine times higher than the mean value of the averaged downloading rates of nodes in the randomly built network. The above simulation result is solid evidence that Link-Level-Homogeneous network can enhance the downloading performance of end users so that the QoS of the live video streaming system is improved.

FIG. 10 shows an example of a complete live video streaming system, which is beneficially enhanced by incorporating the innovations described above. The original raw content is first generated from the A/V source and then injected into the media server for distribution. The individual user in the overlay network downloads the video content and plays the content at the playout rate r which is determined by the media server.

According to various disclosed embodiments, there is provided: a multistreaming peer-to-peer network, comprising: a plurality of nodes connected in a peer-to-peer architecture, through connecting links which have balanced reserved bandwidths; multiple stream trees defined on said nodes, singly containing less than all nodes for a single stream, and jointly containing all nodes for all streams; wherein each said stream tree includes both leaf nodes and interior nodes; and wherein a node can be an interior node of one tree, but cannot be an interior node of any two said trees at the same time.

According to various disclosed embodiments, there is provided: A multi-stream peer-to-peer communications architecture, comprising: a peer-to-peer network comprising at least one peer connecting to either a media source or other peers for downloading said content, through connecting links which are balanced to be Link-Level-Homogeneous; at least one tree comprising at least one said peer, wherein some ones of said peers are interior nodes of exactly one of said trees, but no said peer is an interior node of more than one said tree simultaneously; and a bootstrap server maintaining and providing information on said trees and their member peers.

According to various disclosed embodiments, there is provided: A method for adaptively building a peer-to-peer topology for high-bandwidth streaming, comprising: when an added node joins a peer-to-peer network in which multiple substream trees carry separate components of a single high-bandwidth stream, connecting said added node to different interior nodes as sources for each of said substream trees, subject to the requirement that no node can be an interior node of any two substream trees which carry components of the same high-bandwidth stream.

According to various disclosed embodiments, there is provided: a method of multistreaming over a peer-to-peer network, comprising the actions of: when a new node requests downloading, connecting a new peer to a respective node in each of multiple stream trees to thereby receive multiple respective content streams contemporaneously; wherein said respective nodes are selected in dependence of link capacity; and managing said new peer node such that it is only permitted to distribute one stream carried over a selected stream tree.

According to various disclosed embodiments, there is provided: A method of peer-to-peer multistreaming, comprising the actions of: when a new peer requests access, then connecting the new peer to a respective node in each of multiple component stream trees to thereby receive multiple related content streams; wherein said respective nodes are selected in dependence of link capacity; and managing said new peer node such that it is only permitted to distribute one of said content streams carried over a respective one of said component stream trees wherein the addition and deletion of a node in ones of said trees is controlled by a respective control plane.

According to various disclosed embodiments, there is provided: A method of distributing multistreams over a multi-tree peer-to-peer network, comprising the actions of: assigning each stream to a tree under a unique control plane; successively adding a new peer as leaf nodes for downloading content, by: requesting initial node information, from a bootstrap server, for ones of multiple trees of the network; launching a procedure, for respective ones of said initial nodes in its control plane thereof, to find respective parent nodes in dependence of link capacity; connecting said new peer to said parent nodes for multiple trees for streaming; and adding said new peer into one of said control planes to becoming an interior node, by: requesting a certain number of node information contained in said selected control plane from a bootstrap server; and establishing control connections to said nodes.

According to various disclosed embodiments, there is provided: A novel decentralized protocol for constructing a tree-based P2P live video streaming network with the Interior-Node-Disjoint (IND) multi-tree structure with the special Link-Level-Homogeneous property. The IND multi-tree structure recycles the wasted uploading capacities of leaf nodes in the tree-based P2P networks. The IND multi-tree structure also enhances the robustness of the tree-based P2P networks. Moreover, the special Link-Level-Homogeneous property eliminates the bottlenecks in the video delivery paths by ensuring that each downloading link in the network has identical bandwidth reserved. This special designed architecture greatly improves the downloading performance.

Modifications and Variations

As will be recognized by those skilled in the art, the innovative concepts described in the present application can be modified and varied over a tremendous range of applications, and accordingly the scope of patented subject matter is not limited by any of the specific exemplary teachings given. Many variations are noted above, and many others are possible.

For example, in some embodiments the transitions of the walker can be deterministic rather than stochastic. An instance of this would be a walker which transitions only to the first-found adjacent node having the highest fanout-scaled available bandwidth.

It should be noted that the node evaluation criteria used by the walker do not have to be precisely accurate measurements of node optimality, since the overall process has enough stochasticity to achieve good optimization anyway.

It should be also noted that the disclosed inventions are not be limited to a push-based tree architecture in which respective streams are pushed by the parent nodes. The disclosed inventions can well be applied to a pull-based tree architecture in which the child nodes make decision on which stream to download from the parent nodes. In another word, the multitree architecture can change dynamically in dependence of the content requirement of each individual peer.

For another example, in another class of embodiments multiple walkers are sent out in one control plane such that the new node selects the best from multiple results returned by walkers for each tree. This approach trades increased control traffic with reduced number of iterations.

For another example, a variety of rules can be used for stopping the walker procedure. One simple rule is to allow each walker a fixed number of transitions, but another is to stop when a walker has made some fixed number of transitions without improving on the best node previously found.

For another example, in some embodiments the walker procedure can be avoided, by using a centralized approach. To achieve an interior-node-disjoint multi-tree forest with user's specified attaching rules, a central controller can help to determine the parent nodes for each node. It collects all the link capacities from all nodes and performs random sampling. This approach is suitable for centralized applications.

For another example, initial nodes for launch of the walker procedures can be launched in a variety of ways, including random selection or otherwise.

For another example, instead of using one control plane for each tree, one control plane for all trees can be used. This approach requires assigning the control messages and nodes with some identification(s) to identify which tree(s) this message is intended for and which tree the node belongs to.

None of the description in the present application should be read as implying that any particular element, step, or function is an essential element which must be included in the claim scope: THE SCOPE OF PATENTED SUBJECT MATTER IS DEFINED ONLY BY THE ALLOWED CLAIMS. Moreover, none of these claims are intended to invoke paragraph six of 35 USC section 112 unless the exact words “means for” are followed by a participle.

The claims as filed are intended to be as comprehensive as possible, and NO subject matter is intentionally relinquished, dedicated, or abandoned. 

1. A multistreaming peer-to-peer network, comprising: a plurality of nodes connected in a peer-to-peer architecture, through connecting links which have balanced reserved bandwidths; multiple stream trees defined on said nodes, singly containing less than all nodes for a single stream, and jointly containing all nodes for all streams; wherein each said stream tree includes both leaf nodes and interior nodes; and wherein a node can be an interior node of one tree, but cannot be an interior node of any two said trees at the same time.
 2. The network of claim 1, wherein when a new peer joins, it utilizes a walker procedure to find said connecting links.
 3. The network of claim 1, wherein said reserved bandwidths are balanced because node with higher link capacity has a higher probability to become parent node when a new peer joins.
 4. The network of claim 1, wherein ones of said stream trees are controlled by a control plane.
 5. The network of claim 1, wherein each said interior node is permitted to distribute respective stream carried on the respective corresponding tree.
 6. The network of claim 1, wherein each said node is an interior node of exactly one tree.
 7. A multi-stream peer-to-peer communications architecture, comprising: a peer-to-peer network comprising at least one peer connecting to either a media source or other peers for downloading said content, through connecting links which are balanced to be Link-Level-Homogeneous; at least one tree comprising at least one said peer, wherein some ones of said peers are interior nodes of exactly one of said trees, but no said peer is an interior node of more than one said tree simultaneously; and a bootstrap server maintaining and providing information on said trees and their member peers.
 8. The architecture of claim 7, wherein said connecting links for said new peer are determined in dependence of link capacity of nodes, such that nodes with higher link capacity are more likely to be selected as end point of connecting link for next new peer.
 9. The architecture of claim 7, wherein said connecting links are determined by a central controller.
 10. The architecture of claim 7, wherein additions and deletions of nodes of said trees are controlled by a unique control plane.
 11. The architecture of claim 7, wherein said link capacity of a node depends on the number of child nodes connected to it.
 12. The architecture of claim 7, wherein a structured ID format is used to represent parent-child relationship of nodes in said trees.
 13. The architecture of claim 7, wherein said trees are rebuilt when a node departs by adding nodes in disconnected subtrees back in with the limitation that none of said nodes in disconnected subtrees can be selected as a parent node.
 14. A method for adaptively building a peer-to-peer topology for high-bandwidth streaming, comprising: when an added node joins a peer-to-peer network in which multiple substream trees carry separate components of a single high-bandwidth stream, connecting said added node to different interior nodes as sources for each of said substream trees, subject to the requirement that no node can be an interior node of any two substream trees which carry components of the same high-bandwidth stream.
 15. The method of claim 14, wherein said connecting action utilizes a bootstrap server.
 16. The method of claim 14, wherein said connecting action utilizes a bootstrap server to locate a control plane that manages interior nodes of a said respective tree.
 17. The method of claim 14, wherein said connecting action utilizes a walker procedure on a control plane.
 18. The method of claim 14, wherein said connecting action selects interior nodes also in dependence of available capacity thereof.
 19. The method of claim 14, wherein said connecting action selects interior nodes also in dependence of available processing power thereof. 20-40. (canceled) 